On Efficient Reasoning with Implication Constraints
نویسندگان
چکیده
In this paper, we address the complexity issue of reasoning with implication constraints. We consider the IC-RFT problem, which is the problem of deciding whether a conjunctive yes/no query always produces the empty relation (\no" answer) on database instances satisfying a given set of implication constraints, as a central problem in this respect. We show that several other important problems, such as the query containment problem, are polynomially equivalent to the IC-RFT problem. More importantly, we give criteria for designing a set of implication constraints so that an eecient \units-refutation" process can be used to solve the IC-RFT problem.
منابع مشابه
PROPERTY ANALYSIS OF TRIPLE IMPLICATION METHOD FOR APPROXIMATE REASONING ON ATANASSOVS INTUITIONISTIC FUZZY SETS
Firstly, two kinds of natural distances between intuitionistic fuzzy sets are generated by the classical natural distance between fuzzy sets under a unified framework of residual intuitionistic implication operators. Secondly, the continuity and approximation property of a method for solving intuitionistic fuzzy reasoning are defined. It is proved that the triple implication method for intuitio...
متن کاملOn E cient Reasoning with Implication Constraints
In this paper, we address the complexity issue of reasoning with implication constraints. We consider the IC-RFT problem, which is the problem of deciding whether a conjunctive yes/no query always produces the empty relation (\no" answer) on database instances satisfying a given set of implication constraints, as a central problem in this respect. We show that several other important problems, ...
متن کاملEfficient Reasoning About XFDs with Pre-image Semantics
The study of integrity constraints has been identified as one of the major challenges in XML database research. The main difficulty is finding a balance between the expressiveness and the existence of automated reasoning tools. We investigate a previous proposal for functional dependencies in XML (XFDs) that is based on homomorphisms between data trees and schema trees. We demonstrate that reas...
متن کاملROBUSTNESS OF THE TRIPLE IMPLICATION INFERENCE METHOD BASED ON THE WEIGHTED LOGIC METRIC
This paper focuses on the robustness problem of full implication triple implication inference method for fuzzy reasoning. First of all, based on strong regular implication, the weighted logic metric for measuring distance between two fuzzy sets is proposed. Besides, under this metric, some robustness results of the triple implication method are obtained, which demonstrates that the triple impli...
متن کاملUniversal Triple I Method for Fuzzy Reasoning and Fuzzy Controller
As a generalization of the triple I method, the universal triple Imethod is investigated from the viewpoints of both fuzzy reasoningand fuzzy controller. The universal triple I principle is putforward, which improves the previous triple I principle. Then,unified form of universal triple I method is established based onthe (0,1)-implication or R-implication. Moreover, the reversibilityproperty o...
متن کامل